Lazy Learning vs. Speedy Gonzales: a Fast Algorithm for Recursive Identiication and Recursive Validation of Local Constant Models

نویسنده

  • Mauro Birattari
چکیده

In this paper we propose a recursive method for identifying and cross-validating local constant models. The algorithm we derive here is intended to be a part of a more general lazy learning method already presented by the authors (Birattari et al., 1999). We take for granted aspects related to the search of the nearest-neighbors, the deenition of a metric and local combination of estimators, and we focus our attention on the derivation of an eecient way to obtain and assess a sequence of local constant models centered on a given query point, and each including a growing number of nearest-neighbors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive Lazy Learning for Modeling and Control

This paper presents a local method for modeling and control of non-linear dynamical systems, when only a limited amount of input-output data is available. The proposed methodology couples a local model identiication inspired by the lazy learning technique, with a control strategy based on linear optimal control theory. The local mod-eling procedure uses a query-based approach to select the best...

متن کامل

Lazy Learning Meets the Recursive Least Squares Algorithm

Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure. In this paper we propose a data-driven method to select on a query-by-query basis the optimal number of neighbors to be considered for each prediction. As an efficient way to ide...

متن کامل

Lazy Learning for Local Modeling and Control Design

This paper presents local methods for modeling and control of discrete-time unknown nonlinear dynamical systems, when only a limited amount of input-output data is available. We propose the adoption of lazy learning, a memory-based technique for local modeling. The modeling procedure uses a query-based approach to select the best model configuration by assessing and comparing different alternat...

متن کامل

Local Learning for Data Analysis

Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure. In this paper we propose a datadriven method to select on a query-by-query basis the optimal number of neighbors to be considered for each prediction. As an efficient way to iden...

متن کامل

The Lazy Learning Toolbox for Use with Matlab

Lazy learning is a memory-based technique that, once a query is received , extracts a prediction interpolating locally the neighboring examples of the query which are considered relevant according to a distance measure. This toolbox implements a data-driven method to select on a query-by-query basis the optimal number of neighbors to be considered for each prediction. As an eecient way to ident...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999